Braess's Paradox in Large Sparse Graphs
نویسندگان
چکیده
Braess’s paradox, in its original context, is the counter-intuitive observation that, without lessening demand, closing roads can improve traffic flow. With the explosion of distributed (selfish) routing situations understanding this paradox has become an important concern in a broad range of network design situations. However, the previous theoretical work on Braess’s paradox has focused on “designer” graphs or dense graphs, which are unrealistic in practical situations. In this work, we exploit the expansion properties of Erdős-Rényi random graphs to show that Braess’s paradox occurs when np ≥ c log(n) for some c > 1.
منابع مشابه
Braess's paradox in expanders
Expander graphs are known to facilitate effective routing and most real-world networks have expansion properties. At the other extreme, it has been shown that in some special graphs, removing certain edges can lead to more efficient routing. This phenomenon is known as Braess’s paradox and is usually regarded as a rare event. In contrast to what one might expect, we show that Braess’s paradox i...
متن کاملBraess's Paradox in Epidemic Game: Better Condition Results in Less Payoff
Facing the threats of infectious diseases, we take various actions to protect ourselves, but few studies considered an evolving system with competing strategies. In view of that, we propose an evolutionary epidemic model coupled with human behaviors, where individuals have three strategies: vaccination, self-protection and laissez faire, and could adjust their strategies according to their neig...
متن کاملCan Braess's Paradox occur in Loss Networks?
Braess's paradox is said to occur in a network if the addition of an extra link leads to worse performance. It has been shown to occur in transportation networks (such as road networks) and also in queueing networks. Here, we consider the question of whether it can occur in loss networks. We consider two performance measures, acceptance probability and surplus values, and conclude that Braess's...
متن کاملBraess's Paradox and Power-Law Nonlinearities in Five-Arc and Six-Arc Two-Terminal Networks
We extend a general network theorem of Calvert and Keady (CK) relating to the minimum number of arcs needed to guarantee the occurrence of the Braess Paradox. We rephrase the CK theorems and express our proof in the terminology of traffic networks. CK described their theorem in relation to a two-terminal network of liquid in pipes. “Approximately stated, it is: if every relationship between flo...
متن کاملBraess's paradox for the spectral gap in random graphs and delocalization of eigenvectors
0 = λ1 ≤ λ2 ≤ · · · ≤ λn ≤ 2. Interested in λ2, known as the spectral gap. • λ2 = 0 iff G is disconnected • 1/λ2 is the relaxation time of the simple RW on G Conjecture (Fan Chung, 2014). A constant fraction of edges of G(n, p) are such that their removal increases the spectral gap. Adding an edge to random graphs For a graph G = (V,E), let a−(G) := fraction of nonedges in G whose addition decr...
متن کامل